Logics of Finite Hankel Rank

We discuss the Feferman-Vaught Theorem in the setting of abstract model theory for finite structures. We look at sum-like and product-like binary operations on finite structures and their Hankel matrices. We show the connection between Hankel matrices and the Feferman-Vaught Theorem. The largest logic known to satisfy a Feferman-Vaught Theorem for product-like operations is CFOL, first order logic with modular counting quantifiers. For sum-like operations it is CMSOL, the corresponding monadic second order logic. We discuss whether there are maximal logics satisfying Feferman-Vaught Theorems for finite structures.Comment: Appeared in YuriFest 2015, held in honor of Yuri Gurevich's 75th birthday. The final publication is available at Springer via http://dx.doi.org/10.1007/978-3-319-23534-9_1

The co-development of HedgeDATE, a public engagement and decision support tool for air pollution exposure mitigation by green infrastructure

There is a lack of clear guidance regarding the optimal configuration and plant composition of green infrastructure (GI) for improved air quality at local scale. This study aimed to co-develop (i.e. with feedback from end-users) a public engagement and decision support tool, to facilitate effective GI design and management for air pollution abatement. The underlying model uses user-directed input data (e.g. road type) to generate output recommendations (e.g. plant species) and pollution reduction projections. This model was computerised as a user-friendly tool named HedgeDATE (Hedge Design for Abatement of Traffic Emissions). A workshop generated feedback on HedgeDATE, which we also discuss. We found that data from the literature can be synthesised to predict air pollutant exposure and abatement in open road environments. However, further research is required to describe pollutant decay profiles under more diverse roadside scenarios (e.g. split-level terrain) and to strengthen projections. Workshop findings validated the HedgeDATE concept and indicated scope for uptake. End-user feedback was generally positive, although potential improvements were identified. For HedgeDATE to be made relevant for practitioners and decision-makers, future iterations will require enhanced applicability and functionality. This work sets the foundation for the development of advanced GI design tools for reduced pollution exposure

Field's Logic of Truth

Saving Truth from Paradox is a re-exciting development. The 70s and 80s were a time of excitement among people working on the semantic paradoxes. There were continual formal developments, with the constant hope that these results would yield deep insights. The enthusiasm wore off, however, as people became more cognizant of the disparity between what they had accomplished, impressive as it was, and what they had hoped to accomplish. They moved onto other problems that they hoped would prove more yielding. That, at least, was how it seemed to me, so I was delighted to see a dramatically new formal development that is likely to rekindle our enthusiasm

The Flow of Information in Information Retrieval: Towards a general framework for the modelling of information retrieval

The flow of information characterizes the notion of information containment and can generally be defined as the information an object contains about another. The purpose of an information retrieval system is to seek document objects that contain information about a query object. Determining these document objects consists of computing the information contained in them about the query object. Therefore, a modelling approach for information retrieval could be based on a theory that provides for the formal capturing of information and its flow. The modelling approach considered in this paper is based on channel theory, a theory of information that satisfies properties attributed to information and its flow. This paper demonstrates the connection between channel theory and information retrieval. It indicates that channel theory provides an expressive framework for the modelling of information retrieval. In addition, the framework can encompass various features that are becomin..

Semantic information and the correctness theory of truth

The original publication is available at www.springerlink.com Copyright SpringerSemantic information is usually supposed to satisfy the veridicality thesis: p qualifies as semantic information only if p is true. However, what it means for semantic information to be true is often left implicit, with correspondentist interpretations representing the most popular, default option. The article develops an alternative approach, namely a correctness theory of truth (CTT) for semantic information. This is meant as a contribution not only to the philosophy of information but also to the philosophical debate on the nature of truth. After the introduction, in Sect. 2, semantic information is shown to be translatable into propositional semantic information (i). In Sect. 3, i is polarised into a query (Q) and a result (R), qualified by a specific context, a level of abstraction and a purpose. This polarization is normalised in Sect. 4, where [Q + R] is transformed into a Boolean question and its relative yes/no answer [Q + A]. This completes the reduction of the truth of i to the correctness of A. In Sects. 5 and 6, it is argued that (1) A is the correct answer to Q if and only if (2) A correctly saturates Q by verifying and validating it (in the computer science’s sense of “verification” and “validation”); that (2) is the case if and only if (3) [Q + A] generates an adequate model (m) of the relevant system (s) identified by Q; that (3) is the case if and only if (4) m is a proxy of s (in the computer science’s sense of “proxy”) and (5) proximal access to m commutes with the distal access to s (in the category theory’s sense of “commutation”); and that (5) is the case if and only if (6) reading/writing (accessing, in the computer science’s technical sense of the term) m enables one to read/write (access) s. Sect. 7 provides some further clarifications about CTT, in the light of semantic paradoxes. Section 8 draws a general conclusion about the nature of CTT as a theory for systems designers not just systems users. In the course of the article all technical expressions from computer science are explained.Peer reviewe